The constant objective value property for multidimensional assignment problems
نویسندگان
چکیده
منابع مشابه
The constant objective value property for combinatorial optimization problems
Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value. Our central result deals with multi-dimensional assignment problems. We show that for the axial and for the planar d-dimensional assignment problem instances with constant objective value property are characterized by sum-decomposable arra...
متن کاملAsymptotic Results for Random Multidimensional Assignment Problems
The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization problem occurring in applications such as data association and target tracking. In this paper, we investigate characteristics of the mean optimal solution values for random MAPs with axial constraints. Throughout the study, we consider cost coefficients taken from three different random distributions: uniform...
متن کاملOn the Asymptotic Properties of Random Multidimensional Assignment Problems
The Multidimensional Assignment Problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in [1] and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when ...
متن کاملAlternative Fitness Assignment Methods for Many-Objective Optimization Problems
Pareto dominance (PD) has been the most commonly adopted relation to compare solutions in the multiobjective optimization context. Multiobjective evolutionary algorithms (MOEAs) based on PD have been successfully used in order to optimize bi-objective and three-objective problems. However, it has been shown that Pareto dominance loses its effectiveness as the number of objectives increases and ...
متن کاملThe approximability of three-dimensional assignment problems with bottleneck objective
We discuss two special cases of the three-dimensional bottleneck assignment problemwhere a certain underlying cost function satisfies the triangle inequality. We present polynomial time 2-approximation algorithms for the broadest class of these special cases, and we prove that (unless P = NP) this factor 2 is best possible even in the highly restricted setting of the Euclidean plane.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.01.004